From Universal Logic to Computer Science, and Back

نویسنده

  • Razvan Diaconescu
چکیده

Computer Science has been long viewed as a consumer of mathematics in general, and of logic in particular, with few and minor contributions back. In this article we are challenging this view with the case of the relationship between specification theory and the universal

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Systematic literature review of fuzzy logic based text summarization

Information Overloadrq  is not a new term but with the massive development in technology which enables anytime, anywhere, easy and unlimited access; participation & publishing of information has consequently escalated its impact. Assisting userslq    informational searches with reduced reading surfing time by extracting and evaluating accurate, authentic & relevant information are the primary c...

متن کامل

Improving Performance of Opportunistic Routing Protocol using Fuzzy Logic for Vehicular Ad-hoc Networks in Highways

Vehicular ad hoc networks are an emerging technology with an extensive capability in various applications including vehicles safety, traffic management and intelligent transportation systems. Considering the high mobility of vehicles and their inhomogeneous distributions, designing an efficient routing protocol seems necessary. Given the fact that a road is crowded at some sections and is not c...

متن کامل

On the compactness property of extensions of first-order G"{o}del logic

We study three kinds of compactness in some variants of G"{o}del logic: compactness,entailment compactness, and approximate entailment compactness.For countable first-order underlying language we use the Henkinconstruction to prove the compactness property of extensions offirst-order g logic enriched by nullary connective or the Baaz'sprojection connective. In the case of uncountable first-orde...

متن کامل

Algebraic semantics of refinement modal logic

We develop algebraic semantics of refinement modal logic using duality theory. Refinement modal logic has quantifiers that are interpreted using a refinement relation. A refinement relation is like a bisimulation, except that from the three relational requirements only ‘atoms’ and ‘back’ have to be satisfied. We study the dual notion of refinement on algebras and present algebraic semantics of ...

متن کامل

An Optimal Utilization of Cloud Resources using Adaptive Back Propagation Neural Network and Multi-Level Priority Queue Scheduling

With the innovation of cloud computing industry lots of services were provided based on different deployment criteria. Nowadays everyone tries to remain connected and demand maximum utilization of resources with minimum timeand effort. Thus, making it an important challenge in cloud computing for optimum utilization of resources. To overcome this issue, many techniques have been proposed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014